A New Robust and Fast Implicit Polynomial Fitting Technique

نویسندگان

  • Cem Ünsalan
  • Aytül Erçil
چکیده

In this paper Fourier series expansion of polar representation of an object contour is used to obtain robust and fast implicit polynomial fittings for star shaped objects in 2D and 3D. The new fitting algorithm is compared with existing implicit polynomial fitting algorithms with respect fitting performance and timing requirements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3L fitting of higher degree implicit polynomials

Implicit polynomial 2D curves and 3D surfaces are potentially among the most useful object or data representations for use in computer vision and image analysis. That is because of their interpolation property, Euclidean and aane invariants, and Bayesian recog-nizers. This paper studys and compares various tting algorithms in a uniied framework of stability analysis. It presents a new robust 3L...

متن کامل

Implicit Polynomial Based Geometric Shape Modeling and Recognition

This paper presents a brief overview and focuses on two key aspects of a technology for representing and recognizing complicated 2D and 3D shapes subject to partial occlusion and missing data, based on implicit polynomials. The two key aspects are new concepts and results for fast, robust, repeatable tting of implicit poly-nomials to data, and new approaches to representing and recognizing comp...

متن کامل

Robust Fitting of 2D Curves and 3D Surfaces by Implicit Polynomials

This work deals with fitting 2D and 3D implicit polynomials (IPs) to 2D curves and 3D surfaces, respectively. The zero-set of the polynomial is determined by the IP coefficients and describes the data. The polynomial fitting algorithms presented in this paper aim at producing polynomials that are robust to coefficient errors. Special emphasis is given here to errors due to coefficient quantizat...

متن کامل

One Class Classification Using Implicit Polynomial Surface Fitting

When the number of objects in the training set is too small for the number of features used, most classification procedures cannot find good classification boundaries. In this paper, we introduce a new technique to solve the one class classification problem based on fitting an implicit polynomial surface to the point cloud of features to model the one class which we are trying to separate from ...

متن کامل

Affine Invariant 3L Fitting of Implicit Polynomials

Combining implicit polynomials and algebraic invariants for representing and recognizing complicated objects proves to be a powerful technique. However, a basic requirement for using implicit polynomials for affine invariant recognition is to have an affine invariant fitting algorithm. In this paper, we study the problem of affine invariant fitting of an implicit polynomial to data. Received Ja...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999